Fast approximation of convex hull
نویسندگان
چکیده
The construction of a planar convex hull is an essential operation in computational geometry. It has been proven that the time complexity of an exact solution is Ω(NlogN). In this paper, we describe an algorithm with time complexity O(N + k), where k is parameter controlling the approximation quality. This is beneficial for applications processing a large number of points without necessity of an exact solution. A formula for upper bound of the approximation error is presented.
منابع مشابه
Experimental Comparison of the Cost of Approximate and Exact Convex Hull Computation in the Plane
We report on experimental studies regarding the cost of exact and approximate convex hull computation in the plane in order to find out how much time you can save by the transition to approximations. Our experiments let us arrive at the conclusion that in most cases adaptive exact computation based on double expansions as introduced to computational geometry by Shewchuk [13] is as fast as stabl...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملL-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.
متن کاملPii: 0020-0190(89)90045-8
where a(k) = 2(kc1), due to Yao [4]. A fast randomized algorithm for finding diameters in R3 appears in [2]. It may be of interest to find fast approximations to the diameter of P in arbitrary dimension. The notion of approximation in computational geometry is not new, e.g., see [l] for approximation of the convex hull of points. If R is the tightest rectangle with respect to the coordinate axe...
متن کاملFast Subspace Approximation via Greedy Least-Squares
In this note, we develop fast and deterministic dimensionality reduction techniques for a family of subspace approximation problems. Let P ⊂ R be a given set of M points. The techniques developed herein find an O(n logM)-dimensional subspace that is guaranteed to always contain a near-best fit n-dimensional hyperplane H for P with respect to the cumulative projection error (∑ x∈P ‖x−ΠHx‖ p 2 )1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006